The Complete Intersection Theorem for Systems of Finite Sets
نویسندگان
چکیده
منابع مشابه
The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets
The theorem presented and proved in this paper can be viewed as an extension or improvement of our recent Complete Intersection Theorem [1] and may be called the Complete Nontrivial-Intersection Theorem. It goes considerably beyond the well-known Hilton Milner Theorem [10]. We put the result into the proper perspective with a brief sketch of the key steps in its development, beginning with the ...
متن کاملThe Complete Intersection Theorem for Systems of Finite Sets
We are concerned here with one of the oldest problems in combinatorial extremal theory. It is readily described after we have made a few conventions. ގ denotes the set of
متن کاملAn intersection theorem for systems of finite sets
For nonnegative reals ω, ψ and natural t ≤ k ≤ (n + t − 1)/2, the maximum of ω A ∩ [n] k + ψ A ∩ [n] n + t − 1 − k among all t-intersecting set systems A ⊆ 2[n] is determined. © 2015 Elsevier B.V. All rights reserved.
متن کاملAn intersection theorem for systems of sets
Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists C = C(a, q ) such that, for any n ,
متن کاملIntersection Properties of Systems of Finite Sets
Let X be a finite set of cardinality n. If L = {ll , . . ., l,} is a set of nonnegative integers with 1 1 < 1 2 < . . . < lr , and k is a natural number, then by an (n, L, k)-system we mean a collection of k-element subsets of X such that the intersection of any two different sets has cardinality belonging to L. We prove that if d is an (n, L, k)-system, with I ~V I > enr -1 (c = e(k) is a cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1997
ISSN: 0195-6698
DOI: 10.1006/eujc.1995.0092